The Expected Shape of Random Doubly Alternating Baxter Permutations
نویسنده
چکیده
Guibert and Linusson introduced the family of doubly alternating Baxter permutations, i.e. Baxter permutations æ 2 Sn , such that æ and æ°1 are alternating. They proved that the number of such permutations in S2n and S2n+1 is the Catalan number Cn . In this paper we compute the expected limit shape of such permutations, following the approach by Miner and Pak.
منابع مشابه
The Enumeration of Doubly Alternating Baxter Permutations
In this paper, we give an alternative proof that the number of doubly alternating Baxter permutations is Catalan.
متن کاملDoubly alternating Baxter permutations are Catalan
The Baxter permutations who are alternating and whose inverse is also alternating are shown to be enumerated by the Catalan numbers. A bijection to complete binary trees is also given. R esum e Nous montrons que les permutations de Baxter alternantes dont l'inverse est egalement une permutation de Baxter alternante sont enum er ees par les nombres de Catalan. De plus, nous donnons une bijection...
متن کاملDomino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations∗
In 1992 Elkies, Kuperberg, Larsen, and Propp introduced a bijection between domino tilings of Aztec diamonds and certain pairs of alternating-sign matrices whose sizes differ by one. In this paper we first study those smaller permutations which, when viewed as matrices, are paired with the matrices for doubly alternating Baxter permutations. We call these permutations snow ∗2010 AMS Subject Cla...
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملCombinatorial Statistics on Alternating Permutations
We consider two combinatorial statistics on permutations. One is the genus. The other, d̂es, is defined for alternating permutations, as the sum of the number of descents in the subwords formed by the peaks and the valleys. We investigate the distribution of d̂es on genus zero permutations and Baxter permutations. Our qenumerative results relate the d̂es statistic to lattice path enumeration, the ...
متن کامل